• A Roadmap to Fully Homomorphic Elections: Stronger Security, Better Verifiability 

      Gjøsteen, Kristian; Strand, Martin (Chapter, 2017)
      After the trials of remote internet voting for local elections in 2011 and parliamentary elections in 2013, a number of local referendums has renewed interest in internet voting in Norway. The voting scheme used in ...
    • A verifiable shuffle for the GSW cryptosystem 

      Strand, Martin (Journal article; Peer reviewed, 2019)
      This paper provides the first verifiable shuffle specifically for fully homomorphic schemes. A verifiable shuffle is a way to ensure that if a node receives and sends encrypted lists, the content will be the same, even ...
    • Anonymous Tokens with Public Metadata and Applications to Private Contact Tracing 

      Silde, Tjerand; Strand, Martin (Peer reviewed; Journal article, 2022)
      Anonymous single-use tokens have seen recent applications in private Internet browsing and anonymous statistics collection. We develop new schemes in order to include public metadata such as expiration dates for tokens. ...
    • Fully homomorphic encryption with applications to electronic voting 

      Strand, Martin (Doctoral theses at NTNU;2018:33, Doctoral thesis, 2018)
    • Skanning og 3D-modellering av eldre trebygg 

      Tonsiri, Martine Draugedal; Strand, Martin (Bachelor thesis, 2021)
      Denne bacheloroppgaven handler om hvordan man kan 3D-modellere et eldre trebygg, for å hente ut informasjon om materialmengder. Denne informasjonen kan da knyttes opp mot tanken om å kunne gjenbruke materialene ...
    • Use of Messaging Layer Security in a Military UAV Swarm 

      Marstrander, Emil (Master thesis, 2023)
      Forskning på flyvende dronesvermer har fått betydelig interesse de siste årene. En militær dronesverm kan utføre risikofylte oppdrag med lavere risiko for personellet, men introduserer en økt risiko for at fienden ...
    • Verifiable Shuffled Decryption 

      Strand, Martin (Master thesis, 2013)
      We describe the Verifiable Shuffled Decryption problem, and present five solutions based on adapting several existing verifiable shuffles. All but one may have potential for implementation, the choice of which would depend ...